Complexity of cutting words on regular tilings
نویسندگان
چکیده
We show that the complexity of a cutting word u in a regular tiling by a polyomino Q is equal to Pn(u) = (p+q−1)n+1 for all n ≥ 0, where Pn(u) counts the number of distinct factors of length n in the infinite word u and where the boundary of Q is constructed by 2p horizontal and 2q vertical unit segments.
منابع مشابه
Collisions and their Catenations: Ultimately Periodic Tilings of the Plane
Motivated by the study of cellular automata algorithmic and dynamics, we investigate an extension of ultimately periodic words to twodimensional infinite words: collisions. A natural composition operation on tilings leads to a catenation operation on collisions. By existence of aperiodic tile sets, ultimately periodic tilings of the plane cannot generate all possible tilings but exhibit some us...
متن کاملCAD Tools for Creating Space-filing 3D Escher Tiles
We discuss the design and implementation of CAD tools for creating decorative solids that tile 3-space in a regular, isohedral manner. Starting with the simplest case of extruded 2D tilings, we describe geometric algorithms used for maintaining boundary representations of 3D tiles, including a Java implementation of an interactive constrained Delaunay triangulation library and a mesh-cutting al...
متن کاملTiling with Regular Star Polygons
The Archimedean tilings (Figure 1) and polyhedra will be familiar to many readers. They have the property that the tiles of the tiling, or the faces of the polyhedron, are regular polygons, and that the vertices form a single orbit under the symmetries of the tiling or polyhedron. (Grünbaum and Shephard [1] use Archimedean, in relation to tilings, to refer to the sequence of polygons at each ve...
متن کاملMinimal Covers of the Archimedean Tilings, Part II
In Part I of this paper ([PW12]), the minimal regular covers of three of the eight Archimedean tilings were determined. However, the computations described in that work grow more complicated as the number of flag orbits of the tilings increases. In Part II, we develop a new technique in order to present the minimal regular covers of certain periodic abstract polytopes. We then use that techniqu...
متن کاملSpherical F-Tilings by Triangles and r-Sided Regular Polygons, r >= 5
The study of dihedral f-tilings of the sphere S2 by spherical triangles and equiangular spherical quadrangles (which includes the case of 4-sided regular polygons) was presented in [3]. Also, in [6], the study of dihedral f-tilings of S2 whose prototiles are an equilateral triangle (a 3-sided regular polygon) and an isosceles triangle was described (we believe that the analysis considering scal...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Eur. J. Comb.
دوره 28 شماره
صفحات -
تاریخ انتشار 2007